Deterministic and stochastic acceleration techniques for Richardson-type iterations

نویسنده

  • Massimiliano Lupo Pasini
چکیده

The next generation of computational science applications will require numerical solvers that are both reliable and capable of high performance on projected exascale platforms. In order to meet these goals, solvers must be resilient to soft and hard system failures, provide high concurrency on heterogeneous hardware configurations, and retain numerical accuracy and efficiency. This work focuses on the solution of large sparse systems of linear equations, for example of the kind arising from the discretization of partial differential equations (PDEs). Specifically, the goal is to investigate alternative approaches to existing solvers (such as preconditioned Krylov subspace or multigrid methods). To do so, we consider stochastic and deterministic accelerations of relaxation schemes. On the one hand, starting from a convergent splitting of the coefficient matrix, we analyze various types of Monte Carlo acceleration schemes applied to the original preconditioned Richardson (stationary) iteration. These methods are expected to have considerable potential for resiliency to faults when implemented on massively parallel machines. In this framework, we have identified classes of problems and preconditioners that guarantee convergence. On the other hand, we consider Anderson-type accelerations to increase efficiency and improve the convergence rate with respect to one level fixed point schemes. In particular, we focus on a recently introduced method called Alternating Anderson-Richardson (AAR). We provide theoretical results to explain the advantages of AAR over other similar schemes presented in literature and we show numerical results where AAR is competitive against restarted versions of the generalized minimum residual method (GMRES) for problems of different nature and different preconditioning techniques. Monday, April 2, 2018, 1:00 pm Mathematics and Science Center: W306 Advisor: Michele Benzi Mathematics and Computer Science Emory University

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modified frame algorithm and its convergence acceleration by Chebyshev method

The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...

متن کامل

Solving a Stochastic Cellular Manufacturing Model by Using Genetic Algorithms

This paper presents a mathematical model for designing cellular manufacturing systems (CMSs) solved by genetic algorithms. This model assumes a dynamic production, a stochastic demand, routing flexibility, and machine flexibility. CMS is an application of group technology (GT) for clustering parts and machines by means of their operational and / or apparent form similarity in different aspects ...

متن کامل

Poor starting points in machine learning

Poor (even random) starting points for learning/training/optimization are common in machine learning. In many settings, the method of Robbins and Monro (online stochastic gradient descent) is known to be optimal for good starting points, but may not be optimal for poor starting points — indeed, for poor starting points Nesterov acceleration can help during the initial iterations, even though Ne...

متن کامل

APPROXIMATION OF STOCHASTIC PARABOLIC DIFFERENTIAL EQUATIONS WITH TWO DIFFERENT FINITE DIFFERENCE SCHEMES

We focus on the use of two stable and accurate explicit finite difference schemes in order to approximate the solution of stochastic partial differential equations of It¨o type, in particular, parabolic equations. The main properties of these deterministic difference methods, i.e., convergence, consistency, and stability, are separately developed for the stochastic cases.

متن کامل

Capability of the Stochastic Seismic Inversion in Detecting the Thin Beds: a Case Study at One of the Persian Gulf Oilfields

The aim of seismic inversion is mapping all of the subsurface structures from seismic data. Due to the band-limited nature of the seismic data, it is difficult to find a unique solution for seismic inversion. Deterministic methods of seismic inversion are based on try and error techniques and provide a smooth map of elastic properties, while stochastic methods produce high-resolution maps of el...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018